Application of Semidefinite Programming to Circuit Partitioning
نویسندگان
چکیده
Partitioning Changhui Cris Choi Department of Management S ien es The University of Iowa Iowa City, Iowa 52242, U.S.A. Yinyu Ye Department of Management S ien es The University of Iowa Iowa City, Iowa 52242, U.S.A. August 23, 1999 Abstra t In this paper we apply Semide nite Programming (SDP) to solving the ir uit partition problem. Unlike other lo al sear h methods, we rst translate the hypergraph into a weighted (undire ted) graph, and then solve it as a graph partition problem using the re ent semide nite program relaxation and heuristi or randomized approximation. Our preliminary omputational results indi ate that as the number of modules in the ir uit in reases, the quality of the partition resulted from SDP be omes superior to that resulted from previous methods.
منابع مشابه
A Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملMulti Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملBinary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
We introduce a novel optimization method based on semidefinite programming relaxations to the field of computer vision and apply it to the combinatorial problem of minimizing quadratic functionals in binary decision variables subject to linear constraints. The approach is (tuning) parameter-free and computes high-quality combinatorial solutions using interior-point methods (convex programming) ...
متن کاملBinary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming1
We introduce a novel optimization method, semidefinite programming, to the field of computer vision and apply it to the combinatorial problem of minimizing quadratic functionals in binary decision variables subject to linear constraints. The approach is (tuning) parameter free and computes high-quality combinatorial solutions using interior-point methods (convex programming) and a randomized hy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999